Перевод: с английского на русский

с русского на английский

reducibility problem

См. также в других словарях:

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

  • Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… …   Wikipedia

  • Random self-reducibility — (RSR): A good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to solve all instances of a problem by solving a large fraction of the instances.DefinitionIf a function f evaluating any instance x can… …   Wikipedia

  • Clique cover problem — In computational complexity theory, finding a minimum clique cover is a graph theoretical NP complete problem. The problem was one of Richard Karp s original 21 problems shown NP complete in his 1972 paper Reducibility Among Combinatorial… …   Wikipedia

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • Independent set problem — In mathematics, the independent set problem (IS) is a well known problem in graph theory and combinatorics. The independent set problem is known to be NP complete. It is almost identical to the clique problem. Description Given a graph G , an… …   Wikipedia

  • P-NP-Problem — Das P NP Problem (auch P≟NP, P versus NP) ist ein ungelöstes Problem der Mathematik und theoretischen Informatik, speziell der Komplexitätstheorie. Es stellt die Frage, in welcher Beziehung die beiden Komplexitätsklassen P und NP stehen. Erkannt… …   Deutsch Wikipedia

  • P/NP-Problem — Das P NP Problem (auch P≟NP, P versus NP) ist ein ungelöstes Problem der Mathematik und theoretischen Informatik, speziell der Komplexitätstheorie. Es stellt die Frage, ob Probleme existieren, für die eine gegebene Lösung leicht überprüft werden… …   Deutsch Wikipedia

  • P=NP-Problem — Das P NP Problem (auch P≟NP, P versus NP) ist ein ungelöstes Problem der Mathematik und theoretischen Informatik, speziell der Komplexitätstheorie. Es stellt die Frage, ob Probleme existieren, für die eine gegebene Lösung leicht überprüft werden… …   Deutsch Wikipedia

  • Open problem — Open question redirects here. For information on open ended questions, see closed ended question. In science and mathematics, an open problem or an open question is a known problem that can be accurately stated, and has not yet been solved (no… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»